Satisfiability of Word Equations with Constants is in Exponential Space
نویسنده
چکیده
منابع مشابه
Solution to time fractional generalized KdV of order 2q+1 and system of space fractional PDEs
Abstract. In this work, it has been shown that the combined use of exponential operators and integral transforms provides a powerful tool to solve time fractional generalized KdV of order 2q+1 and certain fractional PDEs. It is shown that exponential operators are an effective method for solving certain fractional linear equations with non-constant coefficients. It may be concluded that the com...
متن کاملA comparative study on constitutive modeling of hot deformation flow curves in AZ91 magnesium alloy
Modeling the flow curves of materials at elevated temperatures is the first step in mathematical simulation of the hot deformation processes of them. In this work a comparative study was provided to examine the capability of three different constitutive equations in modeling the hot deformation flow curves of AZ91 magnesium alloy. For this, the Arrhenius equation with strain dependent constants...
متن کاملThermoelastic Analysis in Thick FGM Cylinders with Extended Profile
An exact solution is obtained for an axisymmetric steady-state thermo-mechanical stresses in a thick functionally graded cylinder. The material properties are graded along the radial direction according to an exponential function of radial direction with three constants. The advantage of the proposed model, compared to the models with two constants such as the linear, power ...
متن کاملAsymptotic behavior of a system of two difference equations of exponential form
In this paper, we study the boundedness and persistence of the solutions, the global stability of the unique positive equilibrium point and the rate of convergence of a solution that converges to the equilibrium $E=(bar{x}, bar{y})$ of the system of two difference equations of exponential form: begin{equation*} x_{n+1}=dfrac{a+e^{-(bx_n+cy_n)}}{d+bx_n+cy_n}, y_{n+1}=dfrac{a+e^{-(by_n+cx_n)}}{d+...
متن کاملWord Equations in Nondeterministic Linear Space
Satisfiability of word equations is an important problem in the intersection of formal languages and algebra: Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings. The computational complexity of this problem remains unknown, with the best lower and upper bounds being, re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998